A Parameterisation of Algorithms for Distributed Constraint Optimisation via Potential Games?
نویسندگان
چکیده
This paper introduces a parameterisation of learning algorithms for distributed constraint optimisation problems (DCOPs). This parameterisation encompasses many algorithms developed in both the computer science and game theory literatures. It is built on our insight that when formulated as noncooperative games, DCOPs form a subset of the class of potential games. This result allows us to prove convergence properties of algorithms developed in the computer science literature using game theoretic methods. Furthermore, our parameterisation can assist system designers by making the pros and cons of, and the synergies between, the various DCOP algorithm components clear.
منابع مشابه
A unifying framework for iterative approximate best– response algorithms for distributed constraint optimisation problems1
Distributed constraint optimisation problems (DCOPs) are important in many areas of computer science and optimisation. In a DCOP, each variable is controlled by one of many autonomous agents, who together have the joint goal of maximising a global objective function. A wide variety of techniques have been explored to solve such problems, and here we focus on one of the main families, namely ite...
متن کاملThree Hybrid Metaheuristic Algorithms for Stochastic Flexible Flow Shop Scheduling Problem with Preventive Maintenance and Budget Constraint
Stochastic flexible flow shop scheduling problem (SFFSSP) is one the main focus of researchers due to the complexity arises from inherent uncertainties and also the difficulty of solving such NP-hard problems. Conventionally, in such problems each machine’s job process time may encounter uncertainty due to their relevant random behaviour. In order to examine such problems more realistically, fi...
متن کاملA parameterised model of multimodal freight transportation for maritime services optimisation
Multimodal transport has been promoted by several transport commissions initiatives as an alternative to road transport. A key factor for improving its competitiveness is to provide private and public investors with means of evaluating and selecting the most profitable options. This paper presents a parameterisation schema of a freight transport model for the assessment of a multimodal transpor...
متن کاملAdversarial Constraint Satisfaction by Game-Tree Search
Many decision problems can be modelled as adversarial constraint satisfaction, which allows us to integrate methods from AI game playing. In particular, by using the idea of opponents, we can model both collaborative problem solving, where intelligent participants with different agendas must work together to solve a problem, and multi-criteria optimisation, where one decision maker must balance...
متن کاملGame-theoretical learning for sensor networks
This note provides an indication of potential uses of gametheoretical learning algorithms in sensor networks. In particular we consider the sensor network problem as a fixed optimisation problem, and propose methods that use algorithms designed for repeated normal-form games to induce globally optimal behaviour. Many of the standard algorithms for learning in games are proven to converge in pot...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008